New unified laws in fatigue: From the Wöhler’s to the Paris’ regime

Generalizations and unification of the celebrated Paris’ and Wöhler’s laws for fatigue crack propagation are derived by applying the recently developed quantized (or finite) fracture mechanics. In particular, three generalized Paris’, Wöhler’s or unified laws are proposed and compared, demonstrating their applicability for predicting the life time of structures containing from small (the Wöhler’s regime) to large (the Paris’ regime) propagating fatigue cracks.     

An elementary proof of Sylvester’s double sums for subresultants

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also recently proved by Lascoux and Pragacz using multi-Schur functions and divided differences. In this paper, we provide an elementary proof that uses only basic properties of matrix multiplication and Vandermonde determinants.     

Comparative Coreflood Studies for Precipitation and Adsorption Squeeze with PPCA as the Scales Inhibitor

Comparative adsorption and precipitation squeezes carried out on field core materials demonstrate that significant lifetime enhancement is achievable for precipitation squeeze with respect to more conventional adsorption squeeze. Coreflood tests have been carried out under reservoir conditions (135°C) employing a poly-phosphinocarboxylate (PPCA) as the scales inhibitor. Field treatment simulations, carried out starting from coreflood data and considering the characteristics of a North Sea formation taken as the reference, confirmed the higher performance, in term of squeeze lifetime, of the precipitation squeeze with respect to adsorption. The results pointed out the importance of choosing the appropriate formulation once the operative conditions are known, in order to promote the inhibitor precipitation into the formation. Some implications of these results for the optimization of the precipitation squeeze technology for field applications, with particular emphasis to formation damage, are also discussed.     

Symbolic analysis of linear polyhedra

This paper concerns several analytical problems related to linear polyhedra in euclidean three-dimensional-space. Symbolic formulas for line, surface, and volume integration are given, and it is shown that domain integrals are computable in polynomial time. In particular, it is shown that mass, first and second moments, and products of inertia are computable inO(E) time, whereE is the number of edges of the boundary. Simple symbolic expressions for the normal derivatives of domain integrals are also derived. In particular, it is shown that they are closely linked to the topology of the integration domain, as well as that they are expressible as combinations of domain integrals over lower-order domains (faces, edges, and vertices). The symbolic results presented in this paper may lead to an easy incorporation of integral constraints, for example, concerning mass and inertia, in the engineering designing process of solid objects.     

Exporting water wave optimization concepts to modified simulated annealing algorithm for size optimization of truss structures with natural frequency constraints

This paper proposes an improved version of a recently proposed modified simulated annealing algorithm (MSAA) named as an improved MSAA (I-MSAA) to tackle the size optimization of truss structures with frequency constraint. This kind of problem is problematic because its feasible region is non-convex while the boundaries are highly non-linear. The main motivation is to improve the exploitative behavior of MSAA, taking concept from water wave optimization metaheuristic (WWO). An interesting concept of WWO is its breaking operation. Thirty functions extracted from the CEC2014 test suite and four benchmark truss optimization problems with frequency constraints are explored for the validity of the proposed algorithm. Numerical results indicate that I-MSAA is more reliable, stable and efficient than those found by other existing metaheuristics in the literature.

     

First experiences of teaching quantum computing

The Journal of Supercomputing - Quantum computing is a reality that presents challenges to computer engineering students and practitioners. It has been claimed that it is possible to effectively...     

A Taxonomy of Representation Strategies in Iconic Communication

Predicting whether the intended audience will be able to recognize the meaning of an icon or pictograph is not an easy task. Many icon recognition studies have been conducted in the past. However, their findings cannot be generalized to other icons that were not included in the study, which, we argue, is their main limitation. In this paper, we propose a comprehensive taxonomy of icons that is intended to enable the generalization of the findings of recognition studies. To accomplish this, we analyzed a sample of more than eight hundred icons according to three axes: lexical category, semantic category, and representation strategy. Three basic representation strategies were identified: visual similarity; semantic association; and arbitrary convention. These representation strategies are in agreement with the strategies identified in previous taxonomies. However, a greater number of subcategories of these strategies were identified. Our results also indicate that the lexical and semantic attributes of a concept influence the choice of representation strategy.     

Visual reasoning about social networks using centrality sensitivity

In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance of a node in a network, its sensitivity represents the importance of the relationship between this and all other nodes in the network. We have derived an analytical solution that extracts the sensitivity as the derivative of centrality with respect to degree for two centrality metrics based on feedback and random walks. We show that these sensitivities are good indicators of the distribution of centrality in the network, and how changes are expected to be propagated if we introduce changes to the network. These metrics also help us simplify a complex network in a way that retains the main structural properties and that results in trustworthy, readable diagrams. Sensitivity is also a key concept for uncertainty analysis of social networks, and we show how our approach may help analysts gain insight on the robustness of key network metrics. Through a number of examples, we illustrate the need for measuring sensitivity, and the impact it has on the visualization of and interaction with social and other scale-free networks.     

Model-based testing of software and systems: recent advances and challenges

Model-based testing is focused on testing techniques which rely on the use of models. The diversity of systems and software to be tested implies the need for research on a variety of models and methods for test automation. We briefly review this research area and introduce several papers selected from the 22nd International Conference on Testing Software and Systems (ICTSS).